The weight distribution of the self-dual [128, 64] polarity design code
نویسندگان
چکیده
The weight distribution of the binary self-dual [128, 64] code being the extended code C of the code C spanned by the incidence vectors of the blocks of the polarity design in PG(6, 2) [11] is computed. It is shown also that R(3, 7) and C have no self-dual [128, 64, d] neighbor with d ∈ {20, 24}.
منابع مشابه
A note on formally self-dual even codes of length divisible by 8
A binary code with the same weight distribution as its dual code is called formally self-dual (f.s.d.). We only consider f.s.d. even codes (codes with only even weight codewords). We show that any formally self-dual even binary code C of length n not divisible by 8 is balanced. We show that the weight distribution of a balanced near-extremal f.s.d. even code of length a multiple of 8 is unique....
متن کاملAn Upper Bound for Self-Dual Codes
Gleason has described the general form that the weight distribution of a self-dual code over GF(2) and GF(3) can have. We give an explicit formula for this weight distribution when the minimum distance d between codewords is made as large as possible. It follows that for self-dual codes of length n over GF(2) with all weights divisible by 4, d ~ 4[n/24] + 4; and for self-dual codes over GF(3), ...
متن کاملAn equivalent representation for weighted supremum norm on the upper half-plane
In this paper, rstly, we obtain some inequalities which estimates complex polynomials on the circles.Then, we use these estimates and a Moebius transformation to obtain the dual of this estimates forthe lines in upper half-plane. Finally, for an increasing weight on the upper half-plane withcertain properties and holomorphic functions f on the upper half-plane we obtain an equivalentrepresenta...
متن کاملNew extremal binary self-dual codes of lengths 64 and 66 from bicubic planar graphs
Abstract. In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreo...
متن کاملA strengthening of the Assmus-Mattson theorem
Let w 1 = d, w 2 , ... , w s be the weights of the nonzero codewords in a binary linear [n , k, d] code C, and let w1′ , w2′ , ... , ws ′ ′ be the nonzero weights in the dual code C ⊥ . Let t be an integer in the range 0 < t < d such that there are at most d − t weights wi′ with 0 < wi′ ≤ n − t. Assmus and Mattson proved that the words of any weight w i in C form a t-design. We show that if w 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. in Math. of Comm.
دوره 10 شماره
صفحات -
تاریخ انتشار 2016